Linear Arboricity and Linear k-Arboricity of Regular Graphs
نویسندگان
چکیده
We find upper bounds on the linear k-arboricity of d-regular graphs using a probabilistic argument. For small k these bounds are new. For large k they blend into the known upper bounds on the linear arboricity of regular graphs.
منابع مشابه
Covering regular graphs with forests of small trees
A (d, k) -forest is a forest consisting of trees whose diameters are at most d and whose maximum vertex degree ,6. is at most k. The (d, k)-arboricity of a graph G is the minimum number of (d, k}-forests needed to cover E(G). This concept is a common generalization of linear k-arboricity and star arboricity. Using a probabilistic approach developed recently for linear karboricity, we obtain an ...
متن کاملThe Linear 4-arboricity of Balanced Complete Bipartite Graphs
A linear k-forest is a graph whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by lak(G), is the least number of linear k-forests needed to decompose G. In this paper, it is obtained that la4(Kn,n) = d5n/8e for n ≡ 0( mod 5).
متن کاملLinear Arboricity of Random Regular Graphs
An easy count ing argument shows here that la(G)>f . f f t " d i f f icu l ty is in establishing the upper bound. This problem has received much attention; see Alon [1]. We show here how Alon's beautiful treatment for graphs with large girth allows us easily to handle random regular graphs. By the random regular graph G,,, (where rn is even) we mean a graph picked uniformly at random from the s...
متن کاملOn linear arboricity of cubic graphs
A linear forest is a graph in which each connected component is a chordless path. A linear partition of a graph G is a partition of its edge set into linear forests and la(G) is the minimum number of linear forests in a linear partition. When each path has length at most k a linear forest is a linear k-forest and lak(G) will denote the minimum number of linear k-forests partitioning E(G). We cl...
متن کاملThe linear k-arboricity of the Mycielski graph M(Kn)
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with lengths at most k. The linear k-arboricity Of G, denoted by lak(G), is the minimum number of linear k-forests needed to partition the edge set E(G) of G. In case that the lengths of paths are not restricted, we then have the linear arboricity ofG, denoted by la(G). In this paper, the exact values of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 17 شماره
صفحات -
تاریخ انتشار 2001